#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=60;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],tot=0;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,q;cin>>n>>q;
   for(LL i=1;i<=n;i++){
       LL x;cin>>x;
       if(!a[x]){
          a[x]=i;
       }
   }
   vector<LL>v;
   while(q--){
        LL t;cin>>t;
        v.push_back(a[t]);
        for(LL i=1;i<=50;i++){
            if(a[i]<a[t]){
                a[i]++;
            }
        }
        a[t]=1;
   }
   for(auto i:v){
      cout<<i<<" ";
   }
   cout<<"\n";
   return 0;
}
